Generalized comparison of quadtree and bintree storage requirements

Generalized comparison of quadtree and bintree storage requirements

The quadtree and the bintree data structures are two variants on the principle of hierarchical regular decomposition applied to image representation. A comparison of the storage requirements for images represented by these two methods is presented. The relative storage efficiency of quadand bintrees is determined by two factors: the relative node sizes for the two representations as determined ...

Generalized Comparison of Bintree and 2 N -tree Storage Requirements

Analytical Results on the Quadtree Storage-Requirements

An analysis of the expected size occupied by a Quadtree is presented. The analysis is based on the general assumption that the storage requirements of internal and external nodes differ. Besides, formulae for the expected number of internal and external nodes at a specific level of the tree are given. Next, the space efficiency of the most popular Quadtree implementations is examined. Finally, ...

A Bintree Representation of Generalized Binary Digital Images

A d-dimensional binary digital image can most easily be modelled by a d-dimensional binary array. Each element of the array represents a (d-dimensional) pixel which is normally called "black" ("white") if the element's value is 1 (0). For most purposes it is necessary to introduce topological notions (adjacency, connectedness, etc.) for digital images and to study their properties. This is the ...

Reducing storage requirements for biological sequence comparison

MOTIVATION Comparison of nucleic acid and protein sequences is a fundamental tool of modern bioinformatics. A dominant method of such string matching is the 'seed-and-extend' approach, in which occurrences of short subsequences called 'seeds' are used to search for potentially longer matches in a large database of sequences. Each such potential match is then checked to see if it extends beyond ...